Detection of time-frequency hopping patterns

ABSTRACT

The present invention relates to a method for detecting a pilot pattern, comprising a pilot signal s p (t), in a received signal r(t) implemented in an Orthogonal Frequency Division Multiplexing (OFDM) system. The method comprises the steps: computing a value of a log-likelihood function  (τ 0 ,ν 0 ) for a hypotheses space specified by the pilot signal s p (t) and an initial time frequency offset (τ 0 ,ν 0 ), and relating the computed value to a reference value to detect the pilot pattern.

TECHNICAL FIELD

The present invention is related a method for detecting a time-frequency hopping pattern in OFDM (Orthogonal Frequency Division Multiplexing) systems.

BACKGROUND

Conventionally, a wireless communication channel in a single-carrier transmission system is modeled as having a time-varying impulse response g(τ, t), which may be frequency selective for any given time t due to multipaths. The channel's frequency selectivity can be estimated by observing the known pilot signal transmitted during the time of interest whereas the time selectivity is usually tracked by observing multiples of these periodically inserted known signals.

However, in a land mobile communication environment, the channel's selectivity is mainly caused by movement of the terminal. For as long as the velocity of the movement remains constant, the channel can be modeled by a time-invariant delay-Doppler response h(τ,ν), which represents the complex-valued channel gain of the scatterer incurring a delay τ and Doppler shift ν to the incoming signal. For various reasons, this fact has been used mostly as a design limitation on the frequency of pilot insertion in the time domain to avoid aliasing. Slightly more sophisticated usage of the Doppler information may be found in the channel tracking related filter design that requires the estimation of the channel's Doppler spread.

A time-frequency hopping pattern is a signal whose frequency contents change as a function of time, either periodically or non-periodically, in a specific manner. Time-frequency hopping signals have been used in many communication and radar applications. Recently, due to popular adaptation of Orthogonal Frequency Division Multiplexing (OFDM) as the multiple technology in future wireless communication systems, the potential for using them as synchronization signals has been under extensive investigation. Since an OFDM system essentially divides the radio resource into orthogonal time-frequency units, it is natural to design synchronization signals that conform with existing time-frequency partition.

In an OFDM system, pilot symbols are placed periodically in the time-frequency plane for channel estimation. FIG. 1 shows an example of a regularly spaced pilot pattern, denoted φ=0, and a Costas array pattern, denoted φ=1, which is one of many possible variations resulting from shifting the horizontal scan lines of the regularly spaced pilot pattern in a particular order, as is well known for a skilled person in the art. Costas array patterns are disclosed in “Medium Constraints on Sonar Design and Performance”, by J. P. Costas, in EASCON Cony. Rec., 1975, pp 68A-68L.

Each cell in the array represents one of the N_(fft) sub-carriers in an OFDM symbol, which has an interval of T_(s) sec. including T_(cp) sec. of cyclic prefix. Thus, the sub-carrier spacing is f_(s)=1/(T_(s)−T_(cp)) Hz. For the original regularly spaced pattern, one pilot symbol is inserted every N OFDM symbols in the time domain, i.e. T_(p)=NT_(s) and every M sub-carriers in the frequency domain, i.e. f_(p)=Mf_(s). Each pattern may have a sub-carrier offset index 0≦φ≦M with respect to the first sub-carrier.

Any pilot pattern may be specified by a two-dimensional time-frequency array whose element C[n,m] is the complex value of the pilot symbol transmitted on the m'th sub-carrier in the n'th OFDM symbol. Unless otherwise stated, C[n,m] is “1” if a pilot symbol is present and “0” if not. The corresponding continuous-time signal of the pilot pattern over Q time domain periods can be expressed as a sequence of OFDM symbols by:

$\begin{matrix} {{s_{p}(t)} = {\sum\limits_{n = 0}^{{QN} - 1}\; {c_{n}\left( {t - {nT}_{s}} \right)}}} & (1) \\ {where} & \; \\ {{c_{n}(t)} = {\sum\limits_{i = 0}^{N_{fft} - 1}\; {{c_{n}\lbrack i\rbrack}{\mu \left( {t - {iT}_{c}} \right)}}}} & (2) \end{matrix}$

is the n'th OFDM symbol that further consists of a sequence c_(n)[i] modulating the transmit filter pulsing function μ(t). Ignoring cyclic prefix, the pilot pattern's time-frequency array representation C[n,m] is related to the discrete-time sequence c_(n)[i] by

$\begin{matrix} {{{C\left\lbrack {n,m} \right\rbrack} = {\sum\limits_{i = 0}^{N_{fft} - 1}\; {{c_{n}\lbrack i\rbrack}^{\frac{{j2\pi}{mi}}{N_{fft}}}}}},{m = 0},1,\ldots \mspace{14mu},{N_{fft} - 1}} & (3) \end{matrix}$

To demodulate the data symbols in an OFDM system, the receiver needs to know the channel's time-frequency response H(t,f), which is the two-dimensional Fourier transform of the delay-Doppler response h(τ,ν). If sufficient numbers of the base pilot signals are observed over time and frequency, the output of the delay-Doppler correlator is a good approximation of the delay-Doppler response.

The channel is modeled as having a delay-Doppler response h(τ,ν), which represents the complex-valued channel gain of the scatterer incurring a delay τ and Doppler shift ν to the incoming signal. Assuming that the radio environment consists of a continuum of scatterers (or “targets”), each introduces a certain delay and Doppler shift to the signal propagating through it, the received signal corresponding to the pilot is given then by:

r(t)=∫_(ν) ₀ ^(ν) ⁰ ^(+ν) ^(max) ∫_(τ) ₀ ^(τ) ⁰ ^(+τ) ^(max) h(τ,ν)s _(p)(t−τ)e ^(j2 πνt) dτdν+z(t)  (4)

where z(t) is the Additive White Gaussian Noise (AWGN), τ₀ and ν₀ are the initial timing and frequency offset respectively, and

$\begin{matrix} {{{\tau_{\max} \leq \frac{1}{f_{p}}} = {\frac{1}{{Mf}_{s}} = \frac{T_{s} - T_{cp}}{M}}}{{v_{\max} \leq \frac{1}{T_{p}}} = \frac{1}{{NT}_{s}}}} & (5) \end{matrix}$

are the maximum delay and Doppler spread of the channel that are smaller than or equal to the values that can be supported by the pilot's density without aliasing.

Present detectors normally use correlator matched to hypothesized signals and then find peaks and compare them with a certain threshold to determine the presence of the pilot signals. This correlation process may be too computationally complex especially when there are a large number of potential hypotheses.

A known system that uses time-frequency hopping patterns as synchronization signals is disclosed in U.S. Pat. No. 6,961,364 B1, by Laroia et al. Different base stations use patterns with different slopes, and the detection algorithm is a maximum energy detector.

SUMMARY

An object with the present invention is to provide an apparatus and a method for detecting a pilot pattern in an OFDM system with less complex computing compared to prior art.

An additional object is to provide a method for synchronizing and detecting communication devices in a communication network.

The invention solves the problem of detecting time-frequency hopping patterns of a pilot signal that meets a certain criteria in an optimal sense. By applying the principle of Generalized Likelihood Ratio Test (GLRT), the invention provides an optimal likelihood measure for a given hypothesis on the pilot pattern and its time-frequency offset. Based on this likelihood measure, the detection and synchronization of a pilot pattern can be achieved.

An advantage with the present invention is that the invention may be used in an initial synchronization of an OFDM system that uses different time-frequency hopping patterns to identify different devices.

A further advantage is that though the optimal likelihood metric is the integral of the energy at the output of a two-dimensional delay-Doppler correlator, it is not necessary to actually perform the two-dimensional delay-Doppler correlation.

An advantage with a preferred embodiment of the present invention when pilot patterns are used by a multiple of devices that share a common structure, such as circularly shifted patterns, the computation of their likelihood metrics may further be simplified.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows an example of a pilot pattern used in connection with the present invention.

FIG. 2 shows an apparatus for producing a sampled signal from a received signal r(t).

FIG. 3 shows a circularly shifted pattern of a Costas array.

FIG. 4 shows an embodiment of a two-dimensional correlator according to the present invention.

FIG. 5 shows a correlator output array in connection to FIG. 5.

FIG. 6 shows an example of two circularly shifted Costas arrays.

FIG. 7 shows a diagram of single-cell detection with one observation period.

FIG. 8 shows a typical detection metric.

FIG. 9 shows a diagram of two-cell detection in Full channel

FIG. 10 shows a diagram of two-cell detection in Flat channel

DETAILED DESCRIPTION

The objective with the present invention is to detect the presence of a pilot signal, and subsequently achieve a coarse initial time-frequency synchronization by estimating the unknown parameters (τ₀, ν₀).

Assuming that the initial synchronization has been achieved and thus (τ₀,ν₀) are known, the Maximum Likelihood (ML) estimation of the channel ĥ_(ML)(τ,ν), for properly designed pilot signals such as those described above, defined over a range of (τ₀≦τ≦τ₀+τ_(max),ν₀≦_84 ≦ν₀+ν_(max)) is related to the two-dimensional delay-Doppler image I(τ,ν) by:

$\begin{matrix} {{I\left( {\tau,v} \right)}\overset{\Delta}{=}{{\int{{r(t)}{s_{p}^{*}\left( {t - \tau} \right)}^{- {{j2\pi}{vt}}}{t}}} \approx {{{\hat{h}}_{ML}\left( {\tau,v} \right)} \otimes {\chi_{sp}\left( {\tau,v} \right)}} \approx {E_{s}{{\hat{h}}_{ML}\left( {\tau,v} \right)}}}} & (6) \end{matrix}$

where E_(s)=∫|s_(p)(t)|² dt is the energy of the pilot signal over the unspecified observation interval and

χ_(sp)(τ,ν)

∫s _(p)(t)s _(p)*(t−τ)e ^(−2πνt) dt  (7)

is the ambiguity function of the pilot signal s_(p)(t).

In the initial synchronization phase, the initial time-frequency offset (τ₀,ν₀) is unknown and thus needs to be hypothesized. Therefore, the detection of the presence of a pilot pattern and subsequently the identification of the device transmitting it involves the search over the hypotheses space specified by the pilot signal s_(p)(t) and the initial time-frequency offset (τ₀,ν₀).

First, start by conditioning on a given hypothesis of s_(p)(t) and thereafter define a likelihood measure for the hypothesis that the channel's delay-Doppler response begins at (τ₀,ν₀) in the delay-Doppler plane and extends over the range of its maximum delay-Doppler spread. Since the channel response h(τ,ν) is not known, it is a nuisance variable that needs to be removed. This may be accomplished by applying the same method used in the Generalized Likelihood Ratio Test (GLRT). The first step is to estimate the nuisance variable h(τ,ν) assuming the hypothesis (τ₀,ν₀) is correct. From Eq (6), this is given by:

$\begin{matrix} {{{\hat{h}}_{ML}\left( {\tau,v} \right)} = {\frac{1}{E_{s}}{I\left( {\tau,v} \right)}}} & (8) \end{matrix}$

for τ₀≦τ≦τ₀+τ_(max) and ν₀≦ν≦ν₀+ν_(max). The next step is to replace the true channel response with its estimate in the log-likelihood function:

Λ(τ₀,ν₀)=−∫|r(t)−∫_(ν) ₀ ^(ν) ⁰ ^(+ν) ^(max) ∫_(τ) ₀ ^(τ) ⁰ ^(+τ) ^(max) ĥ _(ML)(τ,ν)s _(p)(t−τ)e ^(j2πνt) dτdν| ² dt  (9)

After rearranging and removing irrelevant terms, the log-likelihood function for the hypothesis becomes:

$\begin{matrix} \begin{matrix} {{\Lambda \left( {\tau_{0},v_{0}} \right)} = {\int_{v_{0}}^{v_{0} + v_{\max}}{\int_{\tau_{0}}^{\tau_{0} + \tau_{\max}}\ {{{I\left( {\tau,v} \right)}}^{2}{\tau}\ {v}}}}} \\ {= {\int_{0}^{v_{\max}}{\int_{0}^{\tau_{\max}}\ {{{I\left( {{\tau + \tau_{0}},{v + v_{0}}} \right)}}^{2}{\tau}\ {v}}}}} \end{matrix} & (10) \end{matrix}$

In the generalized Maximum Likelihood sense, the optimal likelihood measure for such hypothesis is thus given by Equation (10), where I(τ,ν) is the delay-Doppler image observed by the hypothesized signal s_(p)(t).

The detection of the pilot pattern is then to evaluate and compare the values of this log-likelihood function among possible hypotheses of s_(p)(t) and (τ₀,ν₀) or to compare them with a certain threshold.

Direct evaluation of Λ(τ₀,ν₀) from Eq. (10) is simply to perform a delay-Doppler correlation and then integrate the energy over the hypothesized range (which is the same as the hypothesis space). Although the formula is valid for all patterns that satisfy the Nyquist criterion (and can therefore be used for channel estimation), the complexity of such direct computation may be excessive for a large number of possible hypotheses that the many devices may assume. Fortunately, as will be seen in the following sections, there are alternative methods for computing the log-likelihood function without explicitly evaluating the delay-Doppler image I(τ,ν). Even greater reduction in complexity is possible if the potential pilot patterns share a certain common structure.

Discrete Implementation of the Detector

As given in Eq. (10), the generalized log-likelihood function Λ(τ₀,ν₀) is simply the integration over the hypothesized range of the energy of the channel's delay-Doppler image I(τ,ν), whose discrete approximation over the range (0≦τ<τ_(max),0≦ν<ν_(max)) may be derived. The time-frequency shifted version of the delay-Doppler image may be expressed as:

$\begin{matrix} \begin{matrix} {{I\left( {{\tau + \tau_{0}},{v + v_{0}}} \right)} = {\int{{r(t)}{s_{p}^{*}\left( {t - \tau - \tau_{0}} \right)}^{{- {{j2\pi}{({v + v_{0}})}}}t}{t}}}} \\ {= {^{{- {{j2\pi}{({v + v_{0}})}}}\tau_{0}}{\int{{\overset{\sim}{r}(t)}{s_{p}^{*}\left( {t - \tau} \right)}^{{- {j2\pi}}\; {vt}}{t}}}}} \end{matrix} & (11) \\ {where} & \; \\ {{\overset{\sim}{r}(t)}\overset{\Delta}{=}{{r\left( {t + \tau_{0}} \right)}^{{- {j2\pi}}\; v_{0}t}}} & (12) \end{matrix}$

is a time-frequency shifted version of the received signal. Since only the amplitude of the delay-Doppler image in the detection phase is of concern, the exponential term before the integral in Eq. (11) is moved to the other side of the equation and a new function for the channel's delay-Doppler image is defined:

$\begin{matrix} \begin{matrix} {{I_{\tau_{0},v_{0}}\left( {\tau,v} \right)}\overset{\Delta}{=}{^{{{j2\pi}{({v + v_{0}})}}\tau_{0}}{I\left( {{\tau + \tau_{0}},{v + v_{0}}} \right)}}} \\ {= {\int{{\overset{\sim}{r}(t)}{s_{p}^{*}\left( {t - \tau} \right)}^{{- {j2\pi}}\; {vt}}{t}}}} \end{matrix} & (13) \end{matrix}$

where the subscripts τ₀,ν₀ indicate its dependence on the initial time-frequency offset hypothesis. The integral in Eq. (13) can be expressed by its discrete sums as:

$\begin{matrix} \begin{matrix} {{I_{\tau_{0},v_{0}}\left\lbrack {k,l} \right\rbrack}\overset{\Delta}{=}{I_{\tau_{0},v_{0}}\left( {{kT}_{c},\frac{1}{{QNT}_{s}}} \right)}} \\ {= {\sum\limits_{n = 0}^{{QN} - 1}\; {^{\frac{{- 2}\pi \; \ln}{QN}}{\int{{\overset{\sim}{r}\left( {t + {nT}_{s}} \right)}{c_{n}^{*}\left( {t - {kT}_{c}} \right)}{t}}}}}} \\ {\approx {\sum\limits_{n = 0}^{{QN} - 1}\; {^{\frac{{- {j2\pi}}\; \ln}{QN}}{\sum\limits_{i = 0}^{N_{fft} - 1}\; {{r_{\tau_{0},v_{0}}\left\lbrack {n,{i + k}} \right\rbrack}{c_{n}^{*}\lbrack i\rbrack}}}}}} \end{matrix} & (14) \end{matrix}$

where I_(τ) ₀ _(,ν) ₀ [k,l] is the channel's delay-Doppler image sampled at a chip rate of 1/T_(c) Hz in the delay domain and QNTs sec. in the Doppler domain, and

$\begin{matrix} \begin{matrix} {{r_{\tau_{0},v_{0}}\left\lbrack {n,i} \right\rbrack} = {\int{{\overset{\sim}{r}\left( {t + {nT}_{s}} \right)}{\mu^{*}\left( {t - {i\; T_{C}}} \right)}{t}}}} \\ {= {\int{{r\left( {t + {nT}_{s} + \tau_{0}} \right)}^{{- {j2\pi}}\; {v_{0}{({t + {nT}_{s}})}}}{\mu^{*}\left( {t - {i\; T_{C}}} \right)}{t}}}} \\ {\approx {^{{- {j2\pi}}\; {v_{0}{({{\; T_{c}} + {nT}_{s}})}}}{\int{{r\left( {t + {nT}_{s} + \tau_{0}} \right)}{\mu^{*}\left( {t - {i\; T_{C}}} \right)}{t}}}}} \end{matrix} & (15) \end{matrix}$

is the output of a receive filter with a time offset τ₀ and frequency offset ν₀ sampled at the chip rate of 1/T_(c) Hz, as shown in FIG. 2. It is also clear that the delay hypothesis τ₀ should preferably be chosen as multiples of the chip duration T_(c).

FIG. 2 shows a device 30 for producing a sampled signal r_(τ) ₀ _(,ν) ₀ [n,i] from a received signal r(t). The received signal is inputted to a filler 31 having a filter function μ*(−t). The filtered signal is sampled, using a sampler 32, at a chip rate of 1/T_(c) Hz, and a negative delay is added in a delayer 33. The sampled and delayed signal is mixed with a signal from a source 34 in a mixer 35 to produce the sampled signal r_(τ) ₀ _(,ν) ₀ [n,i].

Discrete Frequency Domain Implementation

As stated in Eq. (5), the channel's maximum delay-Doppler spread (τ_(max),ν_(max)) should not exceed the values that can be supported by the pilot's density. For the case where the integration in Eq. (10) is carried over the maximum values supported by the pilot's density, the integration can be approximated by the discrete sums of its sampled version over the range of (0≦k<K=N_(fft)/M,0≦l<Q) and is given by:

$\begin{matrix} {{\Lambda \left( {\tau_{0},v_{0}} \right)} = {{\int_{0}^{v_{\max}}{\int_{0}^{\tau_{\max}}{{{I\left( {{\tau + \tau_{0}},{v + v_{0}}} \right)}}^{2}\ {\tau}\ {v}}}} \approx {\sum\limits_{k = 0}^{K - 1}\; {\sum\limits_{l = 0}^{Q - 1}\; {{I_{\tau_{0},v_{0}}\left\lbrack {k,l} \right\rbrack}}^{2}}}}} & (16) \end{matrix}$

The integration over a range greater than (τ_(max),ν_(max)) may degrade the detection performance since unwanted noise is introduced. However, the detection complexity may be significantly reduced as will be described in the following. The detector can then trade off between performance and complexity according to the operating requirement and equipment capability.

When positioned properly within the cyclic prefix window, the convolution in the last part of Eq. (14) becomes circular and can thus be evaluated in the frequency domain using DET (Discrete Fourier Transform):

$\begin{matrix} {{{I_{\tau_{0},v_{0}}\left\lbrack {k,l} \right\rbrack} = {\frac{1}{N_{fft}}{\sum\limits_{n = 0}^{{QN} - 1}\; {\sum\limits_{m = 0}^{N_{fft} - 1}\; {{R_{\tau_{0},v_{0}}\left\lbrack {n,m} \right\rbrack}{C^{*}\left\lbrack {n,m} \right\rbrack}^{\frac{{j2\pi}\; l\; n}{QN} + \frac{{j2\pi}\; k\; m}{N_{fft}}}}}}}}\mspace{20mu} {where}} & (17) \\ {\mspace{79mu} {{R_{\tau_{0},v_{0}}\left\lbrack {n,m} \right\rbrack} = {\sum\limits_{i = 0}^{N_{fft} - 1}\; {{r_{\tau_{0},v_{0}}\left\lbrack {n,i} \right\rbrack}^{- \frac{{j2\pi}\; m\; }{N_{fft}}}}}}} & (18) \end{matrix}$

is the length-N_(fft) DFT of the critically sampled receive signal corresponding to the n'th OFDM symbol and

$\begin{matrix} {{{C\left\lbrack {n,m} \right\rbrack} = {\sum\limits_{i = 0}^{N_{fft} - 1}\; {{c_{n}\lbrack i\rbrack}^{- \frac{{j2\pi}\; {m}}{N_{fft}}}}}},{m = 0},1,\ldots \mspace{14mu},{N_{fft} - 1}} & (19) \end{matrix}$

is the discrete frequency domain representation of the pilot signal in the n'th OFDM symbol. Using FIG. 1 for visual illustration where the columns in the array correspond to the DFT's of the received samples over consecutive OFDM symbols for a given (τ₀,ν₀), this embodiment approximates the likelihood function by the sum of energy over the locations of the hypothesized pattern.

Note that C[n,m] is also non-zero only when a pilot symbol is transmitted on the m'th sub-carrier in the n'th OFDM symbol. Also note that if |C(n,m)| is constant for all (non-zero) pilot symbols and if C(n,m) forms lines of constant slope in the time-frequency plane, this embodiment is reduced to the prior art given in U.S. Pat. No. 6,961,364 B1 mentioned in the background section.

Further, note that {tilde over (R)}[n·m] can be calculated using zero-padding DFT for all possible hypotheses of the initial frequency offset ν₀ if they are regularly spaced at properly chosen interval. For a particular hypothesis of τ₀ for example, a length—LN_(fft) sequence

r _(τ) ₀ [n,i]=∫r(t+nT _(s)+τ₀)μ*(t−iT _(c))dt  (20)

with zero-padding will yield a length—LN_(fft) sequence in which the sub-sequence with indices φ,φ+L, . . . , φ+L(N_(fft)−1) corresponds to R_(τ) ₀ _(,φf) _(s) _(/L)[n,m].

For regularly spaced pilot patterns or their hopping variants described above, the log-likelihood function for a given initial time-frequency offset hypothesis can be evaluated in the discrete frequency domain by:

$\begin{matrix} {{\sum\limits_{k = 0}^{K - 1}\; {\sum\limits_{l = 0}^{Q - 1}\; {{I_{\tau_{0},v_{0}}\left\lbrack {k,l} \right\rbrack}}^{2}}} = {\sum\limits_{n = 0}^{{QN} - 1}\; {\sum\limits_{m = 0}^{N_{fft} - 1}\; {{{R_{\tau_{0},v_{0}}\left\lbrack {n \cdot m} \right\rbrack}{C^{*}\left\lbrack {n,m} \right\rbrack}}}^{2}}}} & (21) \end{matrix}$

which is simply the sum of received signal energy over the locations of the hypothesized pilot pattern on the discrete time-frequency plane.

Discrete Time Domain Implementation

In some cases, it may be more effective to calculate the log-likelihood metric directly in the time domain. For the pilot patterns described in connection with FIG. 1, their time-frequency map C[n, m] is non-zero only at the sub-carrier indices φ_(n),φ_(n)+M, φ_(n)+2M, . . . , where φ_(n) is a hopping sequence as a function of the symbol index n and M is the pilot insertion period in that symbol (not necessarily the pilot insertion period of the original regularly-spaced pattern). Eq. (21) then becomes:

$\begin{matrix} \begin{matrix} {{\sum\limits_{k = 0}^{K - 1}\; {\sum\limits_{l = 0}^{Q - 1}\; {{I_{\tau_{0},v_{0}}\left\lbrack {k,l} \right\rbrack}}^{2}}} = {\sum\limits_{n = 0}^{{QN} - 1}\; {\sum\limits_{m = 0}^{N_{fft} - 1}\; {{{R_{\tau_{0},v_{0}}\left\lbrack {n \cdot m} \right\rbrack}{C^{*}\left\lbrack {n,m} \right\rbrack}}}^{2}}}} \\ {= {\sum\limits_{n = 0}^{{QN} - 1}\; {\sum\limits_{m = 0}^{N_{fft} - 1}\; {{R_{\tau_{0},v_{0}}\left\lbrack {n,{\varphi_{n} + {mM}}} \right\rbrack}}^{2}}}} \end{matrix} & (22) \end{matrix}$

where K=N_(fft)/M.

Substituting R_(τ) ₀ _(,ν) ₀ [n, m] from Eq. (18) with m=φ_(n)+mM, into Eq. (22) gives:

$\begin{matrix} {{\sum\limits_{k = 0}^{K - 1}\; {\sum\limits_{l = 0}^{Q - 1}\; {{I_{\tau_{0},v_{0}}\left\lbrack {k,l} \right\rbrack}}^{2}}} = {K{\sum\limits_{n = 0}^{{QN} - 1}\; {\sum\limits_{m = 0}^{M - 1}\; {\left( {\sum\limits_{i = 0}^{N_{fft} - 1}{{r_{\tau_{0},v_{0}}\left\lbrack {n,i} \right\rbrack}{r_{\tau_{0},v_{0}}^{*}\left\lbrack {n,{i - {mK}}} \right\rbrack}}} \right)^{{- j}\frac{2\pi \; \varphi_{n}m}{M}}}}}}} & (23) \end{matrix}$

which involves the circular self correlation of the received samples at lags that are multiples of K and a few DFT of shorter length.

Special Cases of Circularly Shifted Patterns

The detection of multiple hopping patterns may be greatly simplified if they have a certain common structure. For example, by assigning circularly shifted patterns to different devices. The detection can then be achieved by using a two-dimensional circular correlator matched to the base pattern's time-frequency map. FIG. 3 shows circularly shifted patterns of a Costas array. A second pattern is the original pattern circularly shifted by η OFDM symbols and (μM+φ) sub-carriers. As in the regularly spaced case, patterns with different sub-carrier offset φ are completely orthogonal. For a certain class of Costas arrays, two patterns with the same φ but different m have at most one coincidence per period, see example in FIG. 6. Note that for a Costas sequence of length L, there are a total of L×M×N different circular shifts for identifying different cells if they are time-synchronized. For unsynchronized network, on the other hand, there are L×M distinct circular frequency shifts.

In addition to the artificially introduced circular shift, a pilot pattern may also have a local scale time-frequency offset, due to a variety of reasons, with respect to other references such as patterns from a different base station or the sampling point of a particular terminal. This initial offset is essentially the same as, and is denoted by (τ₀,ν₀) above except for the constraints that they are in the range of 0≦τ₀<T_(s) and 0≦ν₀<f_(s). Any offset outside this range will be folded into the indices η,μ and φ. The detection of a circularly shifted pilot pattern is then to determine its presence at a hypothesized time-frequency coordinate:

τ_(p) =ηT _(s)+τ₀

ν₀=(μM+φ)f _(s)+ν₀  (24)

as shown in magnified scale in FIG. 3.

To demonstrate how the two-dimensional correlator may be implemented, we consider an example that is simplified from the one shown in FIG. 3 by setting the frequency domain pilot insertion period M to 1. For each hypothesis of the initial time-frequency offset (τ₀,ν₀) an L×N (6×7) input array is formed be performing N length-L DFT over the symbol durations and placing the frequency domain samples in N successive columns, as shown by the first matrix 51 in FIG. 4. The initial time-frequency offset hypotheses should preferably be chosen as fractions of the symbol duration and the sub-carrier bandwidth to avoid duplicated computation.

Once the input array is set, the pattern search begins. First, the Costas array is expressed as a frequency-hopping sequence {0,2,1,4,5,3, x} of the symbol index, where “x” indicates a symbol with no pilot sub-carrier. This sequence is placed under the input array for visual illustration purpose. In a first step, the columns of the array are circularly rotated in row (sub-carrier) index by an amount corresponding to this hopping sequence, as illustrated in the second matrix 52 in FIG. 4, and summed across the column (symbol) indices except for the one marked by “x”, resulting a column vector of size L=6. This vector is then placed in a first column 55 of an output array 50 in FIG. 5. In a second step, the Costas sequence is circularly shifted by one unit to the right and the columns of the input array 51 are circularly rotated, as illustrated by the third matrix 53 in FIG. 4, and summed as in the first step. The resulting vector is then placed in the second column 56 of the output array in FIG. 5. This process is continued until all N possible Costas sequence circular shifts are exhausted. The L×N output array 50 will then contain the generalized log-likelihood of all L×N possible hypotheses of the Costas array's circular shifts for a given (τ₀,ν₀). The likelihood test and thresholding can then take place to determine if any target is present. The output array 50 shown in FIG. 5 clearly reveals two outstanding peaks, one located at (η=0,μ=0), denoted 58 in the first column 55 of output array 50, and the other at (η=2,μ=2), denoted 59 in a third column 57 of the output array 50. The vector placed in column 57 is derived from the fourth matrix 54 in FIG. 4 as described above.

The correlation process illustrated in FIGS. 4 and 5 occurs off-line on a memory buffer that contains previously captured data. The same process may alternatively be carried out in real-time in a sliding window in which new data continues to arrive and fill up the array while old ones are being flushed out. In either case, the loading of the memory buffer and the circular rotation of vectors can all be accomplished by modifying address pointers without physically moving the buffer contents. Finally, even though the example shows a single period of the Costas array, the extension to multiple periods is straightforward. A computationally efficient implementation is to sum the energy in multiple periods to form the input array before the correlation takes place.

The procedure for the sliding window embodiment of this special case is briefly described below. The off-line embodiment described above is the same except that the data is already loaded into the buffer and therefore the data acquisition steps can be omitted.

-   1. Perform (zero-padded) DFT of appropriate length on received     samples over one symbol duration. The length of the DFT depends on     the hypothesis on the initial frequency offset ν₀. -   2. Place the absolute square of the DFT output in the first column     of the input array. -   3. Circularly rotate (either the physical content or a pointer) each     of the columns in the input array in a row (sub-carrier) index by an     amount corresponding to the Costas sequence. -   4. Sum the input array across the column (symbol) indices and place     the resulting column vector in the first column of the output array. -   5. Reset the input array pointers displaced as a result of step 3     and advance the input/output arrays (circularly rotating the columns     to the right) by one position. -   6. Get the next segment of received samples over one symbol     duration.

This segment may have overlap with the previous one depending on the hypothesis on τ₀.

-   7. Go to step 1.

Simulation Results

To evaluate the performance of the detector, Costas array pilot patterns 60 described in FIG. 6 are considered. They are generated by circularly shifting the horizontal scan lines of a regular spaced pilot pattern. A first access point has a pilot pattern 61 with a zero-offset base signal and a second access point has a pilot pattern 62 with the base signal cyclically shifted by nf_(p) in frequency and mT in time, as shown in FIG. 7 for (m,n)=(2,1). The number of coincidences in each period 63 between the two patterns is in this example one, since a perfectly periodic Costas sequence with N=6 GF(7) is used for both Costas pilot pattern 61, 62.

Table 1 shows the parameters of the two specific arrays that are simulated. To make a fair comparison, both have a pilot density of approximately 1/256 . The OFDM symbol FFT size for length-16 array is 1024. Since M=16 in this case, the maximum delay spread that can be supported is 1024/16=64 chips, which is set at the length of the cyclic prefix. The OFDM symbol FFT size for length-30 array is 512, i.e. the OFDM symbol interval is half of that in the first array. The cyclic prefix length, however, remains the same so that same maximum delay spread can be accommodated.

TABLE 1 Parameters for two Costas arrays Parameter Array 1 Array 2 N 16 30 M 16 8 N_(fft) 1024 512 N_(cp) 64 64 Costas sequence length L 16 (GF17) 30 (GF31) Number of hypotheses L × M × N 4096 7440

For each realization of the channel in the simulation, an initial random time-frequency offset (τ₀,ν₀) uniformly distributed within the intervals of [0,T_(s)) and [0,f_(s)/2) is introduced. The correlator makes a single hypothesis of (τ₀,ν₀)=(0,0) when forming the input array. This corresponds to coarsely searching for the pilot patterns at an interval of T_(s) sec. in the time domain and f_(s) Hz in the frequency domain. A successful detection is declared if the true target is within one symbol and one sub-carrier on either side of the detected location. After the cell identification and coarse synchronization are achieved, further refined search to establish the boundaries of the channel's delay-Doppler response can follow. This may involve some simple interpolation in case of good SNR (Signal to Noise Ratio), or coherent DFT otherwise.

Table 2 lists a few other parameters common to all simulations. Two Power Delay-Doppler Profiles are simulated. The “Flat” channel is simply a random realization of a zero-mean Gaussian variable and the “Full” channel has a “Case3×Bessel” profile that spread the entire maximum delay-Doppler region. They represent the two extremes of the channel's diversity order. The actual performance in practice should lie somewhere in between. Unless otherwise stated, the number of periods observed over time is 1.

TABLE 2 Some additional parameters for the simulations Parameter Comment Value ρ Energy ratio between pilot and data 12 dB sub-carriers SNR (E_(c)/N₀) Energy per chip over N₀ Variable (assuming all data)

Number of periods accumulated in 1 or 2 time λ(τ, ν) Power Delay-Doppler Profile Flat or Full (Case3 × Bessel)

FIG. 7 shows a diagram of a simulation of a single cell probability of misdetection. The solid line with stars 71 is Array 1 (Costas 16), “Full” 

1. A method for detecting a pilot pattern, comprising a pilot signal s_(p)(t), in a received signal r(t) implemented in an Orthogonal Frequency Division Multiplexing (OFDM) system, said method comprising: computing a value of a log-likelihood function Λ(τ₀,ν₀) for a hypotheses space specified by the pilot signal s_(p)(t) and an initial time frequency offset (τ₀,ν₀), relating the computed value to a reference value to detect the pilot pattern.
 2. The method according to claim 1, wherein the reference value is a threshold value, and the act of relating the computed value comprises comparing the computed value against said threshold value.
 3. The method according to claim 1, wherein the act of relating the computed value comprises evaluating and comparing the computed value among possible hypotheses of the pilot signal s_(p) (t) and initial time frequency offset (τ₀,ν₀).
 4. The method according to claim 1, wherein the act of computing a value is a direct evaluation of the log-likelihood function Λ(τ₀,ν₀), said evaluation comprises: performing a delay-Doppler correlation, and integrating an energy over the hypotheses space.
 5. The method according to claim 1, wherein the log-likelihood function is defined by: Λ(τ₀,ν₀)=∫₀ ^(ν) ^(max) ∫₀ ^(τmax) |I(τ+τ₀ ,ν+ν ₀)|² dτdν where I(τ,ν)

∫r(t)s _(p)*(t−τ)e ^(−j2πνt) dt where I(τ, ν) is a delay-Doppler image, r(t) is the received signal including the pilot pattern, and s_(p)*(t) is a hypothesized pilot signal.
 6. The method according to claim 5, wherein the method further comprises sampling the received signal r(t) to obtain samples r_(τ0,ν0)[n,i] to compute the log-likelihood function, said samples has a time offset τ₀ and frequency offset ν₀ sampled at the chip rate of 1/T_(c), and that said method further comprises choosing the delay hypothesis τ₀ to be multiples of the chip duration T_(c).
 7. The method according to claim 5, wherein said log-likelihood function Λ(τ₀,ν₀) is approximated by discrete sums of its sampled version as ${\Lambda \left( {\tau_{0},v_{0}} \right)} \approx {\sum\limits_{k = 0}^{K - 1}\; {\sum\limits_{l = 0}^{Q - 1}\; {{I_{\tau_{0},v_{0}}\left\lbrack {k,l} \right\rbrack}}^{2}}}$ where ${I_{\tau_{0},v_{0}}\left\lbrack {k,l} \right\rbrack} = {\sum\limits_{n = 0}^{{QN} - 1}\; {^{\frac{- {{j2\pi}\ln}}{QN}}{\sum\limits_{l = 0}^{N_{fft} - 1}\; {{r_{\;_{\tau_{0},v_{0}}}\left\lbrack {n,{i + k}} \right\rbrack}{c_{n}^{*}\lbrack i\rbrack}}}}}$ where I_(τ0,ν0)[k,i] is a sampled delay-Doppler image sampled at a chip rate 1/T_(c) Hz in the delay domain and QNT_(S) sec. in the Doppler domain.
 8. The method according claim 6, wherein the computed value of the log-likelihood function Λ(τ₀,ν₀) is evaluated in the frequency domain using Discrete Fourier Transform (DFT).
 9. The method according to claim 8, wherein the log-likelihood function is evaluated in the frequency domain by: ${\sum\limits_{k = 0}^{K - 1}\; {\sum\limits_{l = 0}^{Q - 1}\; {{I_{\tau_{0},v_{0}}\left\lbrack {k,l} \right\rbrack}}^{2}}} = {\sum\limits_{n = 0}^{{QN} - 1}\; {\sum\limits_{m = 0}^{N_{fft} - 1}\; {{{R_{\tau_{0},v_{0}}\left\lbrack {n,m} \right\rbrack}{C^{*}\left\lbrack {n,m} \right\rbrack}}}^{2}}}$ which is the sum of received signal energy over the locations of the hypothesized pilot signal on a discrete time-frequency plane, where ${R_{\tau_{0},v_{0}}\left\lbrack {n,m} \right\rbrack} = {\sum\limits_{l = 0}^{N_{fft} - 1}\; {{r_{\tau_{0},v_{0}}\left\lbrack {n,i} \right\rbrack}^{\frac{{j2\pi}m}{N_{fft}}}}}$ is a length—N_(fft) DFT of the sampled receive signal corresponding to the n'th OFDM symbol and a time-frequency map: ${{C\left\lbrack {n,m} \right\rbrack} = {\sum\limits_{i = 0}^{N_{fft} - 1}\; {{c_{N}\lbrack i\rbrack}^{\frac{{j2\pi}m}{N_{fft}}}}}},{m = 0},1,\ldots \mspace{14mu},{N_{fft} - 1}$ is a discrete frequency domain representation of the pilot signal in the n'th OFDM symbol.
 10. The method according to claim 6, wherein the computed value of the log-likelihood function Λ(τ₀,ν₀) is evaluated in the time domain using Discrete Fourier Transform (DFT).
 11. The method according to claim 10, wherein the log-likelihood function is evaluated in the time domain by: ${\sum\limits_{k = 0}^{K - 1}\; {\sum\limits_{l = 0}^{Q - 1}\; {{I_{\tau_{0},v_{0}}\left\lbrack {k,l} \right\rbrack}}^{2}}} = {K{\sum\limits_{n = 0}^{{QN} - 1}\; {\sum\limits_{m = 0}^{M - 1}\; {\left( {\sum\limits_{i = 0}^{N_{fft} - 1}{{r_{\tau_{0},v_{0}}\left\lbrack {n,i} \right\rbrack}{r_{\tau_{0},v_{0}}^{*}\left\lbrack {n,{i - {mK}}} \right\rbrack}}} \right)^{{- j}\frac{2\pi \; \varphi_{n}m}{M}}}}}}$ where K−N_(fft)I M.
 12. The method according to claim 1, wherein said method for detecting a pilot pattern is used for synchronizing and/or identifying a multiple of devices in a communication network.
 13. The method according to claim 12, wherein, each device transmits time-frequency hopping pilot signals having a circularly shifted pattern assigned to each device.
 14. A detector implemented in an OFDM system receiving at least one pilot signal generated in said OFDM system, wherein said detector comprises a memory unit and a processing device, and is configured to perform the method according to claim
 1. 15. An OFDM system comprising: at least one base station and at least one mobile communication device, a first node in the system adapted to transmit a pilot signal, and a second node in the system adapted to receive said pilot signal, said second node further comprising a detector which is adapted to perform the method according to claim
 1. 16. A computer software code stored in a memory unit, wherein said software code is configured to execute the method according to claim
 1. 